Inductively Computable Hierarchies and Inductive Algorithmic Complexity
نویسندگان
چکیده
Induction is a prevalent cognitive method in science, while inductive computations are popular in many fields of computer and network technology. The most advanced mathematical model of inductive computations and reasoning is an inductive Turing machine, which is natural extension of the most widespread model of computing devices and computations Turing machine. In comparison with Turing machines, inductive Turing machines represent the next step in the development of computer science providing better models for contemporary computers and computer networks. In this paper (Section 3), we study relations between inductively computable sets, inductively recognizable sets, inductively decidable sets and inductively computable functions. In addition (Section 4), we apply the obtained results to algorithmic information theory demonstrating how inductive Turing machines allow obtaining more information for essentially decreasing complexity in comparison with Turing machines.
منابع مشابه
Finite-State Complexity and the Size of Transducers
Finite-state complexity is a variant of algorithmic information theory obtained by replacing Turing machines with finite transducers. We consider the state-size of transducers needed for minimal descriptions of arbitrary strings and, as our main result, show that the state-size hierarchy with respect to a standard encoding is infinite. We consider also hierarchies yielded by more general comput...
متن کاملParsimony hierarchies for inductive inference
Freivalds defined an acceptable programming system independent criterion for learning programs for functions in which the final programs were required to be both correct and “nearly” minimal size, i.e, within a computable function of being purely minimal size. Kinber showed that this parsimony requirement on final programs limits learning power. However, in scientific inference, parsimony is co...
متن کاملLT^2C^2: A language of thought with Turing-computable Kolmogorov complexity
In this paper, we present a theoretical effort to connect the theory of program size to psychology by implementing a concrete language of thought with Turing-computable Kolmogorov complexity (LTC) satisfying the following requirements: 1) to be simple enough so that the complexity of any given finite binary sequence can be computed, 2) to be based on tangible operations of human reasoning (prin...
متن کاملState-Size Hierarchy for Finite-State Complexity
Finite-state complexity is a variant of algorithmic information theory obtained by replacing Turing machines with finite transducers. We consider the number of states needed for transducers used in minimal descriptions of arbitrary strings and, as our main result, show that the state-size hierarchy with respect to a standard encoding is infinite. We consider corresponding hierarchies yielded by...
متن کاملOn the Existence and Convergence of Computable Universal Priors
Solomono uni ed Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the eld of algorithmic information theory. His central result is that the posterior of his universal semimeasureM converges rapidly to the true sequence generating posterior , if the latter is computable. Hence,M is eligible as a univers...
متن کامل